Parallel computation of polynomial GCD and some related parallel computations over abstract fields
نویسندگان
چکیده
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملNew Deterministic Parallel Algorithms for the Characteristic Polynomial of a Matrix over Abstract Fields
We study deterministic parallel computation of the characteristic polynomial of an nn matrix A over an arbitrary eld F of a positive characteristic c n. Our new NC algorithms run in polylogarithmic time and simultaneously enable us to decrease the known upper bounds on processor complexity by order of magnitude except for matrices A forming an algebraic variety of codimension d c ? 1 in the spa...
متن کاملFast Parallel Computation of the Polynomial Shift
Given an n-degree polynomial f(x) over an arbitrary ring, the shift of f(x) by c is the operation which computes coefficients of the polynomial f(x + c). In this paper we consider the case when the shift by given constant c has to be performed several times (repeatedly). We propose a parallel algorithm suited for SIMD architecture to perform the shift in O(1) time if we have O(n) Processor Elem...
متن کاملGCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation
A heuristic algorithm, GCDHEU, is described for polynomial GCD computation over the integers. The algorithm is based on evaluation at a single large integer value (for each variable), integer GCD computation, and a single-point interpolation scheme. Timing comparisons show that this algorithm is very efficient for most univariate problems and it is also the algorithm of choice for many problems...
متن کاملComputation on Zagreb Polynomial of Some Families of Dendrimers
In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(96)00030-8